TSTP Solution File: NLP265^17 by Lash---1.13
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Lash---1.13
% Problem : NLP265^17 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : lash -P picomus -M modes -p tstp -t %d %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 10:01:26 EDT 2023
% Result : Theorem 0.19s 0.40s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP265^17 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.13 % Command : lash -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 11:10:54 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.40 % SZS status Theorem
% 0.19/0.40 % Mode: cade22grackle2xfee4
% 0.19/0.40 % Steps: 31
% 0.19/0.40 % SZS output start Proof
% 0.19/0.40 thf(ty_mindex, type, mindex : $tType).
% 0.19/0.40 thf(ty_mworld, type, mworld : $tType).
% 0.19/0.40 thf(ty_eigen__1, type, eigen__1 : mworld).
% 0.19/0.40 thf(ty_'#b_bob', type, '#b_bob' : mindex).
% 0.19/0.40 thf(ty_'#b_alice', type, '#b_alice' : mindex).
% 0.19/0.40 thf(ty_portland, type, portland : $i).
% 0.19/0.40 thf(ty_eigen__0, type, eigen__0 : mworld).
% 0.19/0.40 thf(ty_mrel, type, mrel : (mindex>mworld>mworld>$o)).
% 0.19/0.40 thf(ty_mactual, type, mactual : mworld).
% 0.19/0.40 thf(ty_'#i_alice', type, '#i_alice' : mindex).
% 0.19/0.40 thf(ty_bigcity, type, bigcity : ($i>mworld>$o)).
% 0.19/0.40 thf(sP1,plain,sP1 <=> (![X1:mworld]:((((mrel @ '#b_bob') @ mactual) @ X1) => (~(((bigcity @ portland) @ X1))))),introduced(definition,[new_symbols(definition,[sP1])])).
% 0.19/0.40 thf(sP2,plain,sP2 <=> (![X1:mworld]:(((mrel @ '#b_bob') @ X1) @ X1)),introduced(definition,[new_symbols(definition,[sP2])])).
% 0.19/0.40 thf(sP3,plain,sP3 <=> (![X1:mworld]:(((mrel @ '#b_alice') @ X1) @ X1)),introduced(definition,[new_symbols(definition,[sP3])])).
% 0.19/0.40 thf(sP4,plain,sP4 <=> ((bigcity @ portland) @ mactual),introduced(definition,[new_symbols(definition,[sP4])])).
% 0.19/0.40 thf(sP5,plain,sP5 <=> (![X1:mworld]:((((mrel @ '#b_alice') @ mactual) @ X1) => ((bigcity @ portland) @ X1))),introduced(definition,[new_symbols(definition,[sP5])])).
% 0.19/0.40 thf(sP6,plain,sP6 <=> (((mrel @ '#b_bob') @ mactual) @ mactual),introduced(definition,[new_symbols(definition,[sP6])])).
% 0.19/0.40 thf(sP7,plain,sP7 <=> ((((mrel @ '#b_alice') @ mactual) @ mactual) => sP4),introduced(definition,[new_symbols(definition,[sP7])])).
% 0.19/0.40 thf(sP8,plain,sP8 <=> (![X1:mworld]:((((mrel @ '#b_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => (~(((bigcity @ portland) @ X2))))))),introduced(definition,[new_symbols(definition,[sP8])])).
% 0.19/0.40 thf(sP9,plain,sP9 <=> (sP6 => (~(sP4))),introduced(definition,[new_symbols(definition,[sP9])])).
% 0.19/0.40 thf(sP10,plain,sP10 <=> (((mrel @ '#b_alice') @ mactual) @ mactual),introduced(definition,[new_symbols(definition,[sP10])])).
% 0.19/0.40 thf(sP11,plain,sP11 <=> (sP10 => sP1),introduced(definition,[new_symbols(definition,[sP11])])).
% 0.19/0.40 thf(def_mlocal,definition,(mlocal = (^[X1:mworld>$o]:(X1 @ mactual)))).
% 0.19/0.40 thf(def_mnot,definition,(mnot = (^[X1:mworld>$o]:(^[X2:mworld]:((~) @ (X1 @ X2)))))).
% 0.19/0.40 thf(def_mand,definition,(mand = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) & (X2 @ X3))))))).
% 0.19/0.40 thf(def_mor,definition,(mor = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) | (X2 @ X3))))))).
% 0.19/0.40 thf(def_mimplies,definition,(mimplies = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:(((^[X4:$o]:(^[X5:$o]:(X4 => X5))) @ (X1 @ X3)) @ (X2 @ X3))))))).
% 0.19/0.40 thf(def_mequiv,definition,(mequiv = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) <=> (X2 @ X3))))))).
% 0.19/0.40 thf(def_mbox,definition,(mbox = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(![X4:mworld]:(((^[X5:$o]:(^[X6:$o]:(X5 => X6))) @ (((mrel @ X1) @ X3) @ X4)) @ (X2 @ X4)))))))).
% 0.19/0.40 thf(def_mdia,definition,(mdia = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(?[X4:mworld]:((((mrel @ X1) @ X3) @ X4) & (X2 @ X4)))))))).
% 0.19/0.40 thf(con,conjecture,(![X1:mworld]:((((mrel @ '#i_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => ((bigcity @ portland) @ X2)))))).
% 0.19/0.40 thf(h0,negated_conjecture,(~((![X1:mworld]:((((mrel @ '#i_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => ((bigcity @ portland) @ X2))))))),inference(assume_negation,[status(cth)],[con])).
% 0.19/0.40 thf(h1,assumption,(~(((((mrel @ '#i_alice') @ mactual) @ eigen__0) => (![X1:mworld]:((((mrel @ '#b_bob') @ eigen__0) @ X1) => ((bigcity @ portland) @ X1)))))),introduced(assumption,[])).
% 0.19/0.40 thf(h2,assumption,(((mrel @ '#i_alice') @ mactual) @ eigen__0),introduced(assumption,[])).
% 0.19/0.40 thf(h3,assumption,(~((![X1:mworld]:((((mrel @ '#b_bob') @ eigen__0) @ X1) => ((bigcity @ portland) @ X1))))),introduced(assumption,[])).
% 0.19/0.40 thf(h4,assumption,(~(((((mrel @ '#b_bob') @ eigen__0) @ eigen__1) => ((bigcity @ portland) @ eigen__1)))),introduced(assumption,[])).
% 0.19/0.40 thf(h5,assumption,(((mrel @ '#b_bob') @ eigen__0) @ eigen__1),introduced(assumption,[])).
% 0.19/0.40 thf(h6,assumption,(~(((bigcity @ portland) @ eigen__1))),introduced(assumption,[])).
% 0.19/0.40 thf(1,plain,((~(sP9) | ~(sP6)) | ~(sP4)),inference(prop_rule,[status(thm)],[])).
% 0.19/0.40 thf(2,plain,(~(sP1) | sP9),inference(all_rule,[status(thm)],[])).
% 0.19/0.40 thf(3,plain,((~(sP11) | ~(sP10)) | sP1),inference(prop_rule,[status(thm)],[])).
% 0.19/0.40 thf(4,plain,((~(sP7) | ~(sP10)) | sP4),inference(prop_rule,[status(thm)],[])).
% 0.19/0.40 thf(5,plain,(~(sP3) | sP10),inference(all_rule,[status(thm)],[])).
% 0.19/0.40 thf(6,plain,(~(sP2) | sP6),inference(all_rule,[status(thm)],[])).
% 0.19/0.40 thf(7,plain,(~(sP5) | sP7),inference(all_rule,[status(thm)],[])).
% 0.19/0.40 thf(8,plain,(~(sP8) | sP11),inference(all_rule,[status(thm)],[])).
% 0.19/0.40 thf(axiom_3,axiom,sP8).
% 0.19/0.40 thf(axiom_2,axiom,sP5).
% 0.19/0.40 thf('mrel_#b_bob_reflexive',axiom,sP2).
% 0.19/0.40 thf('mrel_#b_alice_reflexive',axiom,sP3).
% 0.19/0.40 thf(9,plain,$false,inference(prop_unsat,[status(thm),assumptions([h5,h6,h4,h2,h3,h1,h0])],[1,2,3,4,5,6,7,8,axiom_3,axiom_2,'mrel_#b_bob_reflexive','mrel_#b_alice_reflexive'])).
% 0.19/0.40 thf(10,plain,$false,inference(tab_negimp,[status(thm),assumptions([h4,h2,h3,h1,h0]),tab_negimp(discharge,[h5,h6])],[h4,9,h5,h6])).
% 0.19/0.40 thf(11,plain,$false,inference(tab_negall,[status(thm),assumptions([h2,h3,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__1)],[h3,10,h4])).
% 0.19/0.40 thf(12,plain,$false,inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,11,h2,h3])).
% 0.19/0.40 thf(13,plain,$false,inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,12,h1])).
% 0.19/0.40 thf(0,theorem,(![X1:mworld]:((((mrel @ '#i_alice') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#b_bob') @ X1) @ X2) => ((bigcity @ portland) @ X2))))),inference(contra,[status(thm),contra(discharge,[h0])],[13,h0])).
% 0.19/0.40 % SZS output end Proof
%------------------------------------------------------------------------------